A note on supersaturated set systems
نویسندگان
چکیده
منابع مشابه
Note on Set Cover
Greedy: Θ(min(logd,q)): Θ(H(d)) (this also implies O(logn), n is number of elements). (Note: Feige [3] prove that there is no substantially improvement (for greedy algo).) Also O(q) and exists tight example (section 2.5); so, Θ(q) in general. Note that this bound is asymptotically tight (see Vazirani’s book [10] section 29.9) Slav́ık [9] also gives exact analysis lnn− lnlnn+Θ(1). LP Rounding: O(...
متن کاملA Note on the Comparisons among Coherent Systems
Using the concept of system signature introduced by Samaniego (1985), Kochar et al. (1999) compared the lifetimes of the systems in which the lifetimes of the components are independent and identically distributed (i.i.d.) random variables. Their results are extended to the systems with exchangeable components by Navarro et al. (2005). This paper gives some alternative proofs to obtain th...
متن کاملA note on approximation conditions, standard triangularizability and a power set topology
The main result of this article is that for collections of entry-wise non-negative matrices the property of possessing a standard triangularization is stable under approximation. The methodology introduced to prove this result allows us to offer quick proofs of the corresponding results of [B. R. Yahaghi, Near triangularizability implies triangularizability, Canad. Math. Bull. 47, (2004), no. 2...
متن کاملA Note on Bainbridge’s Power Set Construction
The category Rel of sets and relations has two natural traced monoidal structures: in Rel Tr , the tensor is given by disjoint union, and in Rel Tr by products of sets. Already in 1976, predating the definition of traced monoidal categories by 20 years, Bainbridge has shown how to model flowcharts and networks in these two respective settings. Bainbridge has also pointed out that one can move f...
متن کاملA note on traces of set families
A family of sets F ⊆ 2[n] is defined to be l-trace k-Sperner if for any l-subset L of [n] the family of traces F|L = {F ∩L : F ∈ F} does not contain any chain of length k+ 1. In this paper we prove that for any positive integers l′, k with l′ < k if F is (n−l′)-trace k-Sperner, then |F| ≤ (k − l′ + o(1)) ( n bn/2c ) and this bound is asymptotically tight. AMS subject classification: 05D05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.03.028